---
categories: Data structure techniques, Data structures, Graph algorithms
---

## Problems
- [Problem L - Let there be rainbows!](https://ipsc.ksp.sk/2009/real/problems/l.html)
- [Query on a tree](http://www.spoj.com/problems/QTREE/)
- [Monopoly](https://www.codechef.com/problems/MONOPLOY)

## Implementations
- [Heavy-light decomposition implementation](http://codeforces.com/blog/entry/22072) by Al.Cash (C++)
- [Heavy-light tree decomposition for vertices or edges](https://sites.google.com/site/indy256/algo/heavy_light) by indy256 (Java)

## See also
- [Centroid decomposition]()

## External links
- [Heavy-light decomposition](http://wcipeg.com/wiki/Heavy-light_decomposition)
- [Solution to Problem L – Let there be rainbows!](https://ipsc.ksp.sk/2009/real/solutions/l.html)
- [Heavy Light Decomposition](https://blog.anudeep2011.com/heavy-light-decomposition/)
- [Heavy path decomposition](https://en.wikipedia.org/wiki/Heavy_path_decomposition)
- [Heavy-light decomposition - it can be simple!](http://www.codeforces.com/blog/entry/12239)
- [Heavy-light декомпозиция](http://e-maxx.ru/algo/heavy_light)
- [Heavy Light Decomposition | Set 1 (Introduction)](https://www.geeksforgeeks.org/heavy-light-decomposition-set-1-introduction/)
- [Heavy Light Decomposition | Set 2 (Implementation)](https://www.geeksforgeeks.org/heavy-light-decomposition-set-2-implementation/)